Numerical computation of minimal polynomial bases: A generalized resultant approach
نویسندگان
چکیده
منابع مشابه
Numerical Computation of Minimal Polynomial Bases: A Generalized Resultant Approach
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be imple...
متن کاملOn the Computation of Minimal Polynomial Bases
The problem of determination of a minimal polynomial basis of a rational vector space is the starting point of many control analysis, synthesis and design techniques. In this paper, we propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s). The proposed method exploits the structure of the left null space of generalized W...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملNumerical Computation of Gröbner Bases for Zero-dimensional Polynomial Ideals
It is well known that in the computation of Gröbner bases an arbitrarily small perturbation in the coefficients of polynomials may lead to a completely different staircase even if the roots of the polynomials change continuously. This phenomenon is called pseudo singularity in this paper. We show how such phenomenon may be detected and even “repaired” by adding a new variable and a binomial rel...
متن کاملNumerical computation of Gröbner bases
In this paper we deal with the problem of numerical computation of Gröbner bases of zero-dimensional polynomial systems. It is well known that the computation of a Gröbner basis cannot be generally executed in floating-point arithmetic by a standard approach. This, however, would be highly desirable for practical applications. We present an approach for computing Gröbner bases numerically. It i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2005
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.03.017